On the Maximum Number of Different Ordered Pairs of Symbols in Sets of Latin Squares
نویسندگان
چکیده
In this paper we study the problem of constructing sets of s latin squares of order m such that the average number of different ordered pairs obtained by superimposing two of the s squares in the set is as large as possible. We solve this problem (for all s) when m is a prime power by using projective planes. We also present upper and lower bounds for all positive integers m.
منابع مشابه
ON THE SPECTRUM OF r-ORTHOGONAL LATIN SQUARES OF DIFFERENT ORDERS
Two Latin squares of order n are orthogonal if in their superposition, each of the n ordered pairs of symbols occurs exactly once. Colbourn, Zhang and Zhu, in a series of papers, determined the integers r for which there exist a pair of Latin squares of order n having exactly r different ordered pairs in their superposition. Dukes and Howell defined the same problem for Latin squares of differe...
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملHamiltonian double latin squares
A double latin square of order 2n on symbols s1;y; sn is a 2n 2n matrix A 1⁄4 ðaijÞ in which each aij is one of the symbols s1;y; sn and each sk occurs twice in each row and twice in each column. For k 1⁄4 1;y; n let BðA; skÞ be the bipartite graph with vertices r1;y; r2n; c1;y; c2n and 4n edges 1⁄2ri; cj corresponding to ordered pairs ði; jÞ such that aij 1⁄4 sk: We say that A is Hamiltonian i...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملOn Orthogonality of Latin Squares
Abstract: A Latin square arrangement is an arrangement of s symbols in s rows and s columns, such that every symbol occurs once in each row and each column. When two Latin squares of same order superimposed on one another, then in the resultant array every ordered pair of symbols occurs exactly once, then the two Latin squares are said to be orthogonal. A frequency square M of type F (n; λ) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004